Distributionally Robust Chance Constrained Data-Enabled Predictive Control

نویسندگان

چکیده

In this article we study the problem of finite-time constrained optimal control unknown stochastic linear time-invariant (LTI) systems, which is key ingredient a predictive algorithm—albeit typically having access to model. We propose novel distributionally robust data-enabled (DeePC) algorithm uses noise-corrupted input/output data predict future trajectories and compute inputs while satisfying output chance constraints. The based on 1) nonparametric representation subspace spanning system behavior, where past are sorted in Page or Hankel matrices; 2) optimization formulation gives rise strong probabilistic performance guarantees. show that for certain objective functions, DeePC exhibits out-of-sample performance, at same time respects constraints with high probability. provides an end-to-end approach design LTI systems. illustrate closed-loop aerial robotics case study.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributionally robust chance-constrained linear programs

In this paper, we discuss linear programs in which the data that specify the constraints are subject to random uncertainty. A usual approach in this setting is to enforce the constraints up to a given level of probability. We show that for a wide class of probability distributions (i.e. radial distributions) on the data, the probability constraints can be explicitly converted into convex second...

متن کامل

On Distributionally Robust Chance-Constrained Linear Programs1

In this paper, we discuss linear programs in which the data that specify the constraints are subject to random uncertainty. A usual approach in this setting is to enforce the constraints up to a given level of probability. We show that, for a wide class of probability distributions (namely, radial distributions) on the data, the probability constraints can be converted explicitly into convex se...

متن کامل

Distributionally Robust Chance-Constrained Bin Packing

Chance-constrained bin packing problem allocates a set of items into bins and, for each bin, bounds the probability that the total weight of packed items exceeds the bin’s capacity. Different from the stochastic programming approaches relying on full distributional information of the random item weights, we assume that only the information of the mean and covariance matrix is available. Accordi...

متن کامل

On distributionally robust joint chance-constrained problems

Introduction: A chance constrained optimization problem involves constraints with stochastic data that are required to be satisfied with a pre-specified probability. When the underlying distribution of the stochastic data is not known precisely, an often used model is to require the chance constraints to hold for all distributions in a given family. Such a problem is known as a distributionally...

متن کامل

Existence of Nash equilibrium for distributionally robust chance-constrained games

We consider an n-player finite strategic game. The payoff vector of each player is a random vector whose distribution is not completely known. We assume that the distribution of the random payoff vector of each player belongs to a distributional uncertainty set. Using distributionally robust approach, we define a chance-constrained game with respect to the worst-case chanceconstraint. We call s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Automatic Control

سال: 2022

ISSN: ['0018-9286', '1558-2523', '2334-3303']

DOI: https://doi.org/10.1109/tac.2021.3097706